Bounded monochromatic components for random graphs
نویسندگان
چکیده
منابع مشابه
Partitioning Random Graphs into Monochromatic Components
Erdős, Gyárfás, and Pyber (1991) conjectured that every r-colored complete graph can be partitioned into at most r − 1 monochromatic components; this is a strengthening of a conjecture of Lovász (1975) and Ryser (1970) in which the components are only required to form a cover. An important partial result of Haxell and Kohayakawa (1995) shows that a partition into r monochromatic components is p...
متن کاملColourings with bounded monochromatic components in graphs of given circumference
We prove that every graph with circumference at most k is O(log k)colourable such that every monochromatic component has size at most k. The O(log k) bound on the number of colours is best possible, even in the setting of colourings with bounded monochromatic degree. ∗ On leave from IMFM, Ljubljana, Slovenia. Research supported by an NSERC Discovery Grant, CRC program, and in part by ARRS, Rese...
متن کاملRigid Components of Random Graphs
The planar rigidity problem asks, given a set of m pairwise distances among a set P of n unknown points, whether it is possible to reconstruct P , up to a finite set of possibilities (modulo rigid motions of the plane). The celebrated Maxwell-Laman Theorem from Rigidity Theory says that, generically, the rigidity problem has a combinatorial answer: the underlying combinatorial structure must co...
متن کاملUnicyclic Components in Random Graphs
Random graphs underly processes such as polymerization [1], percolation [2], and the formation of social networks [3, 4]. Random graphs have been extensively studied, especially in theoretical computer science [5, 6]. Special families of random graphs have been also examined, e.g., planar random graphs appear in combinatorics [7, 8] and in physics [9]. The basic framework for generic random gra...
متن کاملDynamics of Random Graphs with Bounded Degrees
We investigate the dynamic formation of regular random graphs. In our model, we pick a pair of nodes at random and connect them with a link if both of their degrees are smaller than d. Starting with a set of isolated nodes, we repeat this linking step until a regular random graph, where all nodes have degree d, forms. We view this process as a multivariate aggregation process, and formally solv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2018
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2018.v9.n3.a1